Trace abstraction modulo probability

Refinement of Trace Abstraction

We present a new counterexample-guided abstraction refinement scheme. The scheme refines an over-approximation of the set of possible traces. Each refinement step introduces a finite automaton that recognizes a set of infeasible traces. A central idea enabling our approach is to use interpolants (assertions generated, e.g., by the infeasibility proof for an error trace) in order to automaticall...

IC3 Modulo Theories via Implicit Predicate Abstraction

We present a novel approach for generalizing the IC3 algorithm for invariant checking from finite-state to infinite-state transition systems, expressed over some background theories. The procedure is based on a tight integration of IC3 with Implicit (predicate) Abstraction, a technique that expresses abstract transitions without computing explicitly the abstract system and is incremental with r...

Refining Trace Abstraction using Abstract Interpretation

The CEGAR loop in software model checking notoriously diverges when the abstraction refinement procedure does not derive a loop invariant. An abstraction refinement procedure based on an SMT solver is applied to a trace, i.e., a restricted form of a program (without loops). In this paper, we present a new abstraction refinement procedure that aims at circumventing this restriction whenever poss...

On large execution traces and trace abstraction techniques

Adaptive Trace Abstraction Approach for Predicting Business Process Performances

This paper presents an approach to the discovery of predictive process models, which combines a series of data mining techniques (ranging from pattern mining, to non-parametric regression and to predictive clustering) with ad-hoc data transformation and abstraction mechanisms. As a result, a modular representation of the process is obtained, where different performance-relevant variants of it a...